Critical Slowing Down in Polynomial Time Algorithms
نویسندگان
چکیده
منابع مشابه
Critical slowing down in polynomial time algorithms.
Combinatorial optimization algorithms that compute exact ground states for disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using the physical features of the models, such as vanishing stiffness on one side of the transition and the ground state degeneracy, the number of operations needed in the push-relabel algorithm for the random field Ising...
متن کاملCritical Slowing-Down in SU (2) Landau Gauge-Fixing Algorithms
We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in SU(2) lattice gauge theory on a 2-dimensional lattice. We consider five such algorithms, and lattice sizes ranging from 82 to 362 (up to 642 in the case of Fourier acceleration). We measure four different observables and we find that for each given algorithm they all have the same relaxation time within ...
متن کاملCluster Algorithms: Beyond Suppression of Critical Slowing Down
The cluster algorithm pioneered by Swendsen and Wang is widely acclaimed for its ability to suppress dynamic slowing down near a critical point. However, the cluster approach permits the formulation of Monte Carlo algorithms that yield important additional efficiency gains. For systems with long-range interactions, Luijten and Blöte have introduced a method in which the number of operations per...
متن کاملCritical slowing down in random anisotropy magnets
We study the purely relaxational critical dynamics with non-conserved order parameter (model A critical dynamics) for three-dimensional magnets with disorder in a form of the random anisotropy axis. For the random axis anisotropic distribution, the static asymptotic critical behaviour coincides with that of random site Ising systems. Therefore the asymptotic critical dynamics is governed by the...
متن کاملThe removal of critical slowing down
J. Brannicka, R. C. Browerbc, S. F. McCormicke, T. A. Manteuffele, J. C. Osbornbd and C. Rebbibc a Department of Mathematics, The Pennsylvania State University, 221 McAllister Building, University Park, PA 16802, USA b Center for Computational Science, Boston University, 3 Cummington St, MA 02215, USA c Department of Physics, Boston University, 590 Commonwealth Avenue, Boston, MA 02215, USA d A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2001
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.88.017202